Mechanisms for improved covariant type-checking
نویسندگان
چکیده
Covariant types are a powerful language feature for improving type-safety. However, covariant types complicate type-checking when combined with polymorphism. We propose two new language features that can improve type-checking in a language with polymorphism and covariant typing, and also have the potential to improve efficiency as well. Published by Elsevier Ltd.
منابع مشابه
A Semantic Model of Types and Machine Instructions for Proof-Carrying Code
Proof-carrying code is a framework for proving the safety of machine-language programs with a machinecheckable proof. Such proofs have previously defined type-checking rules as part of the logic. We show a universal type framework for proof-carrying code that will allow a code producer to choose a programming language, prove the type rules for that language as lemmas in higher-order logic, then...
متن کاملSpecialization inheritance and specialization bounded polymorphism
We define a specialization inheritance mechanism for object-oriented programming, admitting covariant redefinition of both methods and instance variables in subclassing. We investigate on the semantic weakness that makes such very flexible inheritance infeasible for a statically type-checked programming language supporting polymorphic assignment and polymorphic method invocation. We show that t...
متن کاملAdmissible Vectors of a Covariant Representation of a Dynamical System
In this paper, we introduce admissible vectors of covariant representations of a dynamical system which are extensions of the usual ones, and compare them with each other. Also, we give some sufficient conditions for a vector to be admissible vector of a covariant pair of a dynamical system. In addition, we show the existence of Parseval frames for some special subspaces of $L^2(G)$ related to...
متن کاملCovariant description of X-ray diffraction from anisotropically relaxed epitaxial structures
A general theoretical approach to the description of epitaxial layers with essentially different cell parameters and in-plane relaxation anisotropy has been developed. A covariant description of relaxation in such structures has been introduced. An iteration method for evaluation of these parameters on the basis of the diffraction data set has been worked out together with error analysis and re...
متن کاملFiniteness and unitarity of Lorentz covariant Green-Schwarz superstring amplitudes
In two recent papers, a new method was developed for calculating ten-dimensional superstring amplitudes with an arbitrary number of loops and external massless particles, and for expressing them in manifestly Lorentz-invariant form. By explicitly checking for divergences when the Riemann surface degenerates, these amplitudes are proven to be finite. By choosing light-cone moduli for the surface...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Languages, Systems & Structures
دوره 34 شماره
صفحات -
تاریخ انتشار 2008